Properties of Overwriting for Updates in Typed Kleene Algebras
نویسنده
چکیده
In this paper we present an abstract representation of pointer structures in Kleene algebras and the properties of a particular selective update function. These can be used as prerequisites for the definition of in-situ pointer updates and a general framework to derive in-situ pointer algorithms from their specification.
منابع مشابه
Typing theorems of omega algebra
Typed omega algebras extend Kozen’s typed Kleene algebras by an operation for infinite iteration in a similar way as Cohen’s omega algebras extend Kleene algebras in the untyped case. Typing these algebras is motivated by non-square matrices in automata constructions and applications in program semantics. For several reasons – the theory of untyped (Kleene or omega) algebras is well developed, ...
متن کاملUntyping Typed Algebraic Structures
Algebraic structures sometimes need to be typed. For example, matrices over a ring form a ring, but the product is a only a partial operation: dimensions have to agree. Therefore, an easy way to look at matrices algebraically is to consider “typed rings”. We prove some “untyping” theorems: in some algebras (semirings, Kleene algebras, residuated monoids), types can be reconstructed from valid u...
متن کاملTowards a Typed Omega Algebra
We propose axioms for 1-free omega algebra, typed 1-free omega algebra and typed omega algebra. They are based on Kozen’s axioms for 1-free and typed Kleene algebra and Cohen’s axioms for the omega operation. In contrast to Kleene algebra, several laws of omega algebra turn into independent axioms in the typed or 1-free variants. We set up a matrix algebra over typed 1-free omega algebras by li...
متن کاملType Systems for Polynomial-time Computation Vom Fachbereich Mathematik Der Technischen Universitt at Darmstadt Angenommene Habilitationsschrift Von
This thesis introduces and studies a typed lambda calculus with higher-order primitive recursion over inductive datatypes which has the property that all de nable number-theoretic functions are polynomial time computable. This is achieved by imposing type-theoretic restrictions on the way results of recursive calls can be used. The main technical result is the proof of the characteristic proper...
متن کامل*-Continuous Kleene ω-Algebras
We define and study basic properties of ∗-continuous Kleene ω-algebras that involve a ∗-continuous Kleene algebra with a ∗-continuous action on a semimodule and an infinite product operation that is also ∗-continuous. We show that ∗-continuous Kleene ω-algebras give rise to iteration semiring-semimodule pairs. We show how our work can be applied to solve certain energy problems for hybrid systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000